Random Union-Closed Families
نویسندگان
چکیده
We shall show that the union-closed families conjecture holds for a random union-closed family with high probability. This strengthens a recent result of Bruhn and Schaudt.
منابع مشابه
Computing Planar Intertwines
The proof of Wagner's Conjecture by Robertson and Seymour gives a nite description of any family of graphs which is closed under the minor ordering. This description is a nite set of graphs called the obstructions of the family. Since the intersection and the union of two minor closed graph families is again a minor closed graph family, an interesting question is that of computing the obstructi...
متن کاملNote on the Union-Closed Sets Conjecture
The union-closed sets conjecture states that if a finite family of sets A 6 = {∅} is union-closed, then there is an element which belongs to at least half the sets in A. In 2001, D. Reimer showed that the average set size of a union-closed family, A, is at least 1 2 log2 |A|. In order to do so, he showed that all union-closed families satisfy a particular condition, which in turn implies the pr...
متن کاملOn averaging Frankl's conjecture for large union-closed-sets
Let F be a union-closed family of subsets of an m-element set A. Let n = |F| ≥ 2 and for a ∈ A let s(a) denote the number of sets in F that contain a. Frankl’s conjecture from 1979, also known as the union-closed sets conjecture, states that there exists an element a ∈ A with n − 2s(a) ≤ 0. Strengthening a result of Gao and Yu [7] we verify the conjecture for the particular case when m ≥ 3 and ...
متن کاملA Closure Algorithm Using a Recursive Decomposition of the Set of Moore Co-families
Given a set Un = {1, ..., n}, a collectionM of subsets of Un that is closed under intersection and contains Un is known as a Moore family. The set of Moore families for a fixed n is in bijection with the set of Moore co-families (union-closed families containing the empty set) denoted itself Mn. This paper follows the work initiated in [8] and [9] about the recursive decomposition of the lattic...
متن کاملTwo Results on Union-Closed Families
We show that there is some absolute constant c > 0, such that for any union-closed family F ⊆ 2, if |F| ≥ ( 1 2 − c)2n, then there is some element i ∈ [n] that appears in at least half of the sets of F . We also show that for any union-closed family F ⊆ 2, the number of sets which are not in F that cover a set in F is at most 2, and provide examples where the inequality is tight.
متن کامل